SherbyNet - /page/wikibook/entry.mu

Micron Document

<!DOCTYPE html>

<title>Shuchi Chawla</title>

</head>

<span id="openzim-page-title" class="mw-page-title-main"><span class="mw-page-title-main">Shuchi Chawla</span></span>

</h1>

</header>

/* start https://en.wikipedia.org/ */

.mw-parser-output .infobox-subbox{padding:0;border:none;margin:-3px;width:auto;min-width:100%;font-size:100%;clear:none;float:none;background-color:transparent}.mw-parser-output .infobox-3cols-child{margin:auto}.mw-parser-output .infobox .navbar{font-size:100%}@media screen{html.skin-theme-clientpref-night .mw-parser-output .infobox-full-data:not(.notheme)>div:not(.notheme)[style]{background:#1f1f23!important;color:#f8f9fa}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .infobox-full-data:not(.notheme)>div:not(.notheme)[style]{background:#1f1f23!important;color:#f8f9fa}}@media(min-width:640px){body.skin--responsive .mw-parser-output .infobox-table{display:table!important}body.skin--responsive .mw-parser-output .infobox-table>caption{display:table-caption!important}body.skin--responsive .mw-parser-output .infobox-table>tbody{display:table-row-group}body.skin--responsive .mw-parser-output .infobox-table th,body.skin--responsive .mw-parser-output .infobox-table td{padding-left:inherit;padding-right:inherit}}

/* end https://en.wikipedia.org/ */

</style><table class="infobox biography vcard"><tbody><tr><th colspan="2" class="infobox-above" style="font-size:125%;"><div class="fn">Shuchi Chawla</div></th></tr><tr><td colspan="2" class="infobox-image"></td></tr><tr><th scope="row" class="infobox-label">Alma mater</th><td class="infobox-data"><style data-mw-deduplicate="TemplateStyles:r1126788409">

/* start https://en.wikipedia.org/ */

.mw-parser-output .plainlist ol,.mw-parser-output .plainlist ul{line-height:inherit;list-style:none;margin:0;padding:0}.mw-parser-output .plainlist ol li,.mw-parser-output .plainlist ul li{margin-bottom:0}

/* end https://en.wikipedia.org/ */

</style><div class="plainlist">

<ul><li><a href="IIT_Delhi" title="IIT Delhi">IIT Delhi</a></li>

<li><a href="Carnegie_Mellon_University" title="Carnegie Mellon University">Carnegie Mellon University</a></li></ul>

</div></td></tr><tr><th scope="row" class="infobox-label">Known for</th><td class="infobox-data">algorithms research</td></tr><tr><th scope="row" class="infobox-label">Awards</th><td class="infobox-data"><div class="plainlist">

<ul><li><a href="NSF_Career_Award" class="mw-redirect" title="NSF Career Award">NSF Career Award</a></li>

<li><a href="Sloan_Research_Fellowship" title="Sloan Research Fellowship">Sloan Research Fellowship</a></li>

<li><a href="Kavli_Foundation_(United_States)" title="Kavli Foundation (United States)">Kavli Frontiers of Science Fellow</a></li></ul>

</div></td></tr><tr><td colspan="2" class="infobox-full-data"><b>Scientific career</b></td></tr><tr><th scope="row" class="infobox-label">Fields</th><td class="infobox-data category"><a href="Computer_science" title="Computer science">Computer science</a></td></tr><tr><th scope="row" class="infobox-label">Institutions</th><td class="infobox-data"><a href="University_of_Texas_at_Austin" title="University of Texas at Austin">University of Texas at Austin</a></td></tr><tr style="display:none"><td colspan="2">

</td></tr></tbody></table>

<p><b>Shuchi Chawla</b> is an Indian computer scientist who works in the design and analysis of <a href="Algorithm" title="Algorithm">algorithms</a>,<sup id="cite_ref-oldcv_1-0" class="reference"><a href="#cite_note-oldcv-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup> and is known for her research on <a href="Correlation_clustering" title="Correlation clustering">correlation clustering</a>,<sup class="nowrap"><a href="#CITEREFCC">[CC]</a></sup> <a href="Information_privacy" title="Information privacy">information privacy</a>,<sup class="nowrap"><a href="#CITEREFPD">[PD]</a></sup> <a href="Mechanism_design" title="Mechanism design">mechanism design</a>,<sup class="nowrap"><a href="#CITEREFMD">[MD]</a></sup> <a href="Approximation_algorithm" title="Approximation algorithm">approximation algorithms</a>,<sup class="nowrap"><a href="#CITEREFAO">[AO]</a></sup> <a href="Hardness_of_approximation" title="Hardness of approximation">hardness of approximation</a>,<sup class="nowrap"><a href="#CITEREFHA">[HA]</a></sup> and <a href="Algorithmic_bias" title="Algorithmic bias">algorithmic bias</a>.<sup id="cite_ref-bias_2-0" class="reference"><a href="#cite_note-bias-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup> She works as a professor of computer science at the <a href="University_of_Texas_at_Austin" title="University of Texas at Austin">University of Texas at Austin</a>.<sup id="cite_ref-profile_3-0" class="reference"><a href="#cite_note-profile-3"><span class="cite-bracket">[</span>3<span class="cite-bracket">]</span></a></sup>

</p>

<div class="mw-heading mw-heading2"><h2 id="Education_and_career">Education and career</h2></div>

<p>Chawla earned a bachelor's degree from the <a href="Indian_Institute_of_Technology_Delhi" class="mw-redirect" title="Indian Institute of Technology Delhi">Indian Institute of Technology Delhi</a> in 2000,<sup id="cite_ref-oldcv_1-1" class="reference"><a href="#cite_note-oldcv-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-oldprofile_4-0" class="reference"><a href="#cite_note-oldprofile-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup> and received her Ph.D. from <a href="Carnegie_Mellon_University" title="Carnegie Mellon University">Carnegie Mellon University</a> in 2005. Her dissertation, <i>Graph Algorithms for Planning and Partitioning</i>, was supervised by <a href="Avrim_Blum" title="Avrim Blum">Avrim Blum</a>.<sup id="cite_ref-mgp_5-0" class="reference"><a href="#cite_note-mgp-5"><span class="cite-bracket">[</span>5<span class="cite-bracket">]</span></a></sup> After postdoctoral studies at <a href="Stanford_University" title="Stanford University">Stanford University</a> under the mentorship of <a href="Tim_Roughgarden" title="Tim Roughgarden">Tim Roughgarden</a>,<sup id="cite_ref-rough_6-0" class="reference"><a href="#cite_note-rough-6"><span class="cite-bracket">[</span>6<span class="cite-bracket">]</span></a></sup> and at <a href="Microsoft_Research" title="Microsoft Research">Microsoft Research</a>, Silicon Valley, she joined the Wisconsin faculty in 2006.<sup id="cite_ref-oldprofile_4-1" class="reference"><a href="#cite_note-oldprofile-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup>. She joined the UT-Austin faculty in 2021.

She won a <a href="Sloan_Research_Fellowship" title="Sloan Research Fellowship">Sloan Research Fellowship</a> in 2009,<sup id="cite_ref-sloan_7-0" class="reference"><a href="#cite_note-sloan-7"><span class="cite-bracket">[</span>7<span class="cite-bracket">]</span></a></sup> and was named a Kavli Fellow in 2012.<sup id="cite_ref-kavli_8-0" class="reference"><a href="#cite_note-kavli-8"><span class="cite-bracket">[</span>8<span class="cite-bracket">]</span></a></sup>

</p>

<div class="mw-heading mw-heading2"><h2 id="Selected_publications">Selected publications</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .citation{word-wrap:break-word}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}

/* end https://en.wikipedia.org/ */

</style><div class="citation wikicite" id="CITEREFMC"><style data-mw-deduplicate="TemplateStyles:r1238218222">

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite id="CITEREFBlumChawla2001" class="citation cs2"><a href="Avrim_Blum" title="Avrim Blum">Blum, Avrim</a>; Chawla, Shuchi (2001), <a rel="nofollow" class="external text" href="https://www.cs.cmu.edu/afs/cs/usr/avrim/www/Papers/mincut.pdf">"Learning from labeled and unlabeled data using graph mincuts"</a> <span class="cs1-format">(PDF)</span>, <i>Proceedings of the Eighteenth International Conference on Machine Learning (ICML '01)</i>, San Francisco, CA, USA: Morgan Kaufmann, pp. <span class="nowrap">19–</span>26, <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>1-55860-778-1</bdi></cite>.</div>

</td></tr></tbody></table>

<td><div class="citation wikicite" id="CITEREFCC"><cite id="CITEREFBansalBlumChawla2004" class="citation cs2">Bansal, Nikhil; <a href="Avrim_Blum" title="Avrim Blum">Blum, Avrim</a>; Chawla, Shuchi (July 2004), <a rel="nofollow" class="external text" href="https://www.cs.cmu.edu/~shuchi/papers/clusteringfull.pdf">"Correlation clustering"</a> <span class="cs1-format">(PDF)</span>, <i><a href="Machine_Learning_(journal)" title="Machine Learning (journal)">Machine Learning</a></i>, <b>56</b> (<span class="nowrap">1–</span>3): <span class="nowrap">89–</span>113, <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1023%2Fb%3Amach.0000033116.57574.95">10.1023/b:mach.0000033116.57574.95</a></span>, <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:207582394">207582394</a></cite>.</div>

</td></tr></tbody></table>

<td><div class="citation wikicite" id="CITEREFPD"><cite id="CITEREFChawlaDworkMcSherrySmith2005" class="citation cs2">Chawla, Shuchi; <a href="Cynthia_Dwork" title="Cynthia Dwork">Dwork, Cynthia</a>; McSherry, Frank; Smith, Adam; Wee, Hoeteck (2005), <a rel="nofollow" class="external text" href="http://www.iacr.org/cryptodb/archive/2005/TCC/3614/3614.pdf">"Toward privacy in public databases"</a> <span class="cs1-format">(PDF)</span>, in Kilian, Joe (ed.), <i>Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings</i>, Lecture Notes in Computer Science, vol. 3378, Springer, pp. <span class="nowrap">363–</span>385, <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1007%2F978-3-540-30576-7_20">10.1007/978-3-540-30576-7_20</a></span>, <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-3-540-24573-5</bdi></cite>.</div>

</td></tr></tbody></table>

<td><div class="citation wikicite" id="CITEREFHA"><cite id="CITEREFChawlaKrauthgamerKumarRabani2006" class="citation cs2">Chawla, Shuchi; Krauthgamer, Robert; Kumar, Ravi; Rabani, Yuval; Sivakumar, D. (2006), "On the hardness of approximating multicut and sparsest-cut", <i>Computational Complexity</i>, <b>15</b> (2): <span class="nowrap">94–</span>114, <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1007%2Fs00037-006-0210-9">10.1007/s00037-006-0210-9</a></span>, <a href="MR_(identifier)" class="mw-redirect" title="MR (identifier)">MR</a> <a rel="nofollow" class="external text" href="https://mathscinet.ams.org/mathscinet-getitem?mr=2243123">2243123</a></cite>.</div>

</td></tr></tbody></table>

<td><div class="citation wikicite" id="CITEREFAO"><cite id="CITEREFBlumChawlaKargerLane2007" class="citation cs2"><a href="Avrim_Blum" title="Avrim Blum">Blum, Avrim</a>; Chawla, Shuchi; <a href="David_Karger" title="David Karger">Karger, David R.</a>; Lane, Terran; Meyerson, Adam; Minkoff, Maria (2007), "Approximation algorithms for orienteering and discounted-reward TSP", <i><a href="SIAM_Journal_on_Computing" title="SIAM Journal on Computing">SIAM Journal on Computing</a></i>, <b>37</b> (2): <span class="nowrap">653–</span>670, <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1137%2F050645464">10.1137/050645464</a>, <a href="MR_(identifier)" class="mw-redirect" title="MR (identifier)">MR</a> <a rel="nofollow" class="external text" href="https://mathscinet.ams.org/mathscinet-getitem?mr=2318723">2318723</a></cite>. Previously announced in the Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.</div>

</td></tr></tbody></table>

<td><div class="citation wikicite" id="CITEREFMD"><cite id="CITEREFChawlaHartlineMalecSivan2010" class="citation cs2">Chawla, Shuchi; Hartline, Jason D.; Malec, David L.; Sivan, Balasubramanian (2010), <a rel="nofollow" class="external text" href="https://www.eecs.northwestern.edu/~hartline/papers/sequential-pricing-STOC-10.pdf">"Multi-parameter mechanism design and sequential posted pricing"</a> <span class="cs1-format">(PDF)</span>, <i>Proceedings of the Forty-Second ACM Symposium on Theory of Computing (STOC '10)</i>, New York, NY, USA: ACM, pp. <span class="nowrap">311–</span>320, <a href="ArXiv_(identifier)" class="mw-redirect" title="ArXiv (identifier)">arXiv</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://arxiv.org/abs/0907.2435">0907.2435</a></span>, <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F1806689.1806733">10.1145/1806689.1806733</a>, <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-1-4503-0050-6</bdi>, <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:53036431">53036431</a></cite>.</div>

</td></tr></tbody></table>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist">

<li id="cite_note-oldcv-1"><span class="mw-cite-backlink">^ <a href="#cite_ref-oldcv_1-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-oldcv_1-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><cite class="citation cs2"><a rel="nofollow" class="external text" href="https://www.cs.cmu.edu/~shuchi/jobapp/Shuchi_CV.pdf"><i>Curriculum vitae</i></a> <span class="cs1-format">(PDF)</span>, Carnegie Mellon University, 2005<span class="reference-accessdate">, retrieved <span class="nowrap">2018-09-18</span></span></cite></span>

</li>

<li id="cite_note-bias-2"><span class="mw-cite-backlink"><b><a href="#cite_ref-bias_2-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFKassner2017" class="citation cs2">Kassner, Michael (July 11, 2017), <a rel="nofollow" class="external text" href="https://www.techrepublic.com/article/fairness-verification-tool-helps-avoid-illegal-bias-in-algorithms/">"Fairness-verification tool helps avoid illegal bias in algorithms"</a>, <i><a href="TechRepublic" title="TechRepublic">TechRepublic</a></i></cite></span>

</li>

<li id="cite_note-profile-3"><span class="mw-cite-backlink"><b><a href="#cite_ref-profile_3-0">^</a></b></span> <span class="reference-text"><cite class="citation cs2"><a rel="nofollow" class="external text" href="https://www.cs.utexas.edu/people/faculty-researchers/shuchi-chawla">"Professor"</a>, <i>Faculty profile</i>, UT-Austin Computer Science Department<span class="reference-accessdate">, retrieved <span class="nowrap">2021-03-10</span></span></cite></span>

</li>

<li id="cite_note-oldprofile-4"><span class="mw-cite-backlink">^ <a href="#cite_ref-oldprofile_4-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-oldprofile_4-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><cite class="citation cs2"><a rel="nofollow" class="external text" href="http://pages.cs.wisc.edu/~shuchi/">"Professor"</a>, <i>Faculty profile</i>, UW-Madison Computer Science Department<span class="reference-accessdate">, retrieved <span class="nowrap">2021-03-10</span></span></cite></span>

</li>

<li id="cite_note-mgp-5"><span class="mw-cite-backlink"><b><a href="#cite_ref-mgp_5-0">^</a></b></span> <span class="reference-text"><a rel="nofollow" class="external text" href="https://mathgenealogy.org/id.php?id=101012">Shuchi Chawla</a> at the <a href="Mathematics_Genealogy_Project" title="Mathematics Genealogy Project">Mathematics Genealogy Project</a></span>

</li>

<li id="cite_note-rough-6"><span class="mw-cite-backlink"><b><a href="#cite_ref-rough_6-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFRoughgarden" class="citation cs2"><a href="Tim_Roughgarden" title="Tim Roughgarden">Roughgarden, Tim</a>, <a rel="nofollow" class="external text" href="https://theory.stanford.edu/~tim/students.html"><i>Tim Roughgarden's Current and Past Students</i></a>, Stanford University<span class="reference-accessdate">, retrieved <span class="nowrap">2018-09-20</span></span></cite></span>

</li>

<li id="cite_note-sloan-7"><span class="mw-cite-backlink"><b><a href="#cite_ref-sloan_7-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFDevitt2009" class="citation cs2">Devitt, Terry (February 20, 2009), <a rel="nofollow" class="external text" href="https://news.wisc.edu/four-faculty-awarded-prestigious-sloan-fellowships/">"Four faculty awarded prestigious Sloan Fellowships"</a>, <i>University of Wisconsin–Madison News</i></cite></span>

</li>

<li id="cite_note-kavli-8"><span class="mw-cite-backlink"><b><a href="#cite_ref-kavli_8-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFBarncard2012" class="citation cs2">Barncard, Chris (November 8, 2012), <a rel="nofollow" class="external text" href="https://news.wisc.edu/uw-contingent-among-kavli-frontiers-of-science-fellows/">"UW contingent among Kavli Frontiers of Science fellows"</a>, <i>University of Wisconsin–Madison News</i></cite></span>

</li>

</ol></div></div>

<div class="mw-heading mw-heading2"><h2 id="External_links">External links</h2></div>

<li><a rel="nofollow" class="external text" href="https://scholar.google.com/citations?user=Znp3UkEAAAAJ">Shuchi Chawla</a> publications indexed by <a href="Google_Scholar" title="Google Scholar">Google Scholar</a></li></ul>

/* start https://en.wikipedia.org/ */

.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}

/* end https://en.wikipedia.org/ */

</style><style data-mw-deduplicate="TemplateStyles:r1236075235">

/* start https://en.wikipedia.org/ */

.mw-parser-output .navbox{box-sizing:border-box;border:1px solid #a2a9b1;width:100%;clear:both;font-size:88%;text-align:center;padding:1px;margin:1em auto 0}.mw-parser-output .navbox .navbox{margin-top:0}.mw-parser-output .navbox+.navbox,.mw-parser-output .navbox+.navbox-styles+.navbox{margin-top:-1px}.mw-parser-output .navbox-inner,.mw-parser-output .navbox-subgroup{width:100%}.mw-parser-output .navbox-group,.mw-parser-output .navbox-title,.mw-parser-output .navbox-abovebelow{padding:0.25em 1em;line-height:1.5em;text-align:center}.mw-parser-output .navbox-group{white-space:nowrap;text-align:right}.mw-parser-output .navbox,.mw-parser-output .navbox-subgroup{background-color:#fdfdfd}.mw-parser-output .navbox-list{line-height:1.5em;border-color:#fdfdfd}.mw-parser-output .navbox-list-with-group{text-align:left;border-left-width:2px;border-left-style:solid}.mw-parser-output tr+tr>.navbox-abovebelow,.mw-parser-output tr+tr>.navbox-group,.mw-parser-output tr+tr>.navbox-image,.mw-parser-output tr+tr>.navbox-list{border-top:2px solid #fdfdfd}.mw-parser-output .navbox-title{background-color:#ccf}.mw-parser-output .navbox-abovebelow,.mw-parser-output .navbox-group,.mw-parser-output .navbox-subgroup .navbox-title{background-color:#ddf}.mw-parser-output .navbox-subgroup .navbox-group,.mw-parser-output .navbox-subgroup .navbox-abovebelow{background-color:#e6e6ff}.mw-parser-output .navbox-even{background-color:#f7f7f7}.mw-parser-output .navbox-odd{background-color:transparent}.mw-parser-output .navbox .hlist td dl,.mw-parser-output .navbox .hlist td ol,.mw-parser-output .navbox .hlist td ul,.mw-parser-output .navbox td.hlist dl,.mw-parser-output .navbox td.hlist ol,.mw-parser-output .navbox td.hlist ul{padding:0.125em 0}.mw-parser-output .navbox .navbar{display:block;font-size:100%}.mw-parser-output .navbox-title .navbar{float:left;text-align:left;margin-right:0.5em}body.skin--responsive .mw-parser-output .navbox-image img{max-width:none!important}@media print{body.ns-0 .mw-parser-output .navbox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style></div><div role="navigation" class="navbox authority-control" aria-label="Navbox802" style="padding:3px"><table class="nowraplinks hlist navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="row" class="navbox-group" style="width:1%">Authority control databases: Academics </th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"><ul><li><span class="uid"><a rel="nofollow" class="external text" href="https://www.mathgenealogy.org/id.php?id=101012">Mathematics Genealogy Project</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://zbmath.org/authors/?q=ai:chawla.shuchi">zbMATH</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://scholar.google.com/citations?user=Znp3UkEAAAAJ">Google Scholar</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://dblp.org/pid/c/ShuchiChawla">DBLP</a></span></li><li><span class="uid"><a rel="nofollow" class="external text" href="https://mathscinet.ams.org/mathscinet/MRAuthorID/717215">MathSciNet</a></span></li></ul></div></td></tr></tbody></table></div></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2025-07-21" href="https://en.wikipedia.org/wiki/?title=Shuchi_Chawla&oldid=1301788907">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>